package com.leetCode.problem;

/**
 * Description:
 * Copyright:   Copyright (c)2019
 * Company:     zefu
 *
 * @author: 张李鑫
 * @version: 1.0
 * Create at:   2021-12-24 17:09:19
 * <p>
 * Modification History:
 * Date         Author      Version     Description
 * ------------------------------------------------------------------
 * 2021-12-24     张李鑫                     1.0         1.0 Version
 */
public class Problem6 {
    public String convert(String s, int numRows) {
        //PAYPALISHIRING
        int[][] arr = new int[numRows][s.length() / 2];
        int row = 0;
        int col = 0;
        int index = 0;
        while (col > s.length() && row > arr[0].length) {
            if (col == 0) {
                arr[col][row] = s.charAt(index++);
                col++;
            }
        }
        return "";
    }
}
